Sub-band coding of hexagonal images

According to the circle-packing theorem, the packing efficiency of a hexagonal lattice is higher than an equivalent square tessellation. Consequently, in several contexts, hexagonally sampled images compared to their Cartesian counterparts are better at preserving information content. In this paper, novel mapping techniques alongside the wavelet compression scheme are presented for hexagonal images. Specifically, we introduce two tree-based coding schemes, referred to as SBHex (spirally-mapped branch-coding for hexagonal images) and BBHex (breadth-first block-coding for hexagonal images). Both of these coding schemes respect the geometry of the hexagonal lattice and yield better compression results. Our empirical results show that the proposed algorithms for hexagonal images produce better reconstruction quality at low bits per pixel representations compared to the tree-based coding counterparts for the Cartesian grid.     

Accelerating BPC-PaCo through Visually Lossless Techniques

Fast image codecs are a current need in applications that deal with large amounts of images. Graphics Processing Units (GPUs) are suitable processors to speed up most kinds of algorithms, especially when they allow fine-grain parallelism. Bitplane Coding with Parallel Coefficient processing (BPC-PaCo) is a recently proposed algorithm for the core stage of wavelet-based image codecs tailored for the highly parallel architectures of GPUs. This algorithm provides complexity scalability to allow faster execution at the expense of coding efficiency. Its main drawback is that the speedup and loss in image quality is controlled only roughly, resulting in visible distortion at low and medium rates. This paper addresses this issue by integrating techniques of visually lossless coding into BPC-PaCo. The resulting method minimizes the visual distortion introduced in the compressed file, obtaining higher-quality images to a human observer. Experimental results also indicate 12% speedups with respect to BPC-PaCo.     

LPNN-based approach for LASSO problem via a sequence of regularized minimizations

In compressive sampling theory, the least absolute shrinkage and selection operator (LASSO) is a representative problem. Nevertheless, the non-differentiable constraint impedes the use of Lagrange programming neural networks (LPNNs). We present in this article the -LPNN model, a novel algorithm that tackles the LASSO minimization together with the underlying theory support. First, we design a sequence of smooth constrained optimization problems, by introducing a convenient differentiable approximation to the non-differentiable -norm constraint. Next, we prove that the optimal solutions of the regularized intermediate problems converge to the optimal sparse signal for the LASSO. Then, for every regularized problem from the sequence, the -LPNN dynamic model is derived, and the asymptotic stability of its equilibrium state is established as well. Finally, numerical simulations are carried out to compare the performance of the proposed -LPNN algorithm with both the LASSO-LPNN model and a standard digital method.     

基于拼接缝自适应消除和全景图矫直的快速图像拼接算法

针对图像拼接存在色差过渡不均匀、图像倾斜扭曲及拼接效率低的现象，提出一种基于拼接缝自适应消除和全景图矫直的快速图像拼接算法。首先，用尺度不变特征变换（SIFT）提取图像指定区域特征点并用双向K近邻（KNN）算法进行图像配准，有效提高算法效率；其次，利用动态规划思想提出自适应公式找到最优拼接缝并用图像融合算法对其自适应消除，解决拼接缝色差过渡不均匀问题；最后，针对累积拼接误差形成全景图倾斜的现象，利用边缘检测算法提出自适应拟合四边形矫直模型，把原始全景图矫直为一个全新的全景图。所提算法与分块图像拼接和二叉树图像拼接算法相比，图像质量提升了5.84%~7.83%，拼接时间仅为原来的50%~70%。实验结果表明，该算法不仅通过自适应更新机制减少不同图像背景下拼接缝色差过渡不均匀的现象，从而提高了图像质量；而且提高了拼接效率，降低了全景图倾斜扭曲程度。     

金沙江水电工程智能建造技术体系研究与实践

运用"全面感知、真实分析、实时控制"的智能闭环控制理论,提出了以工程建设资源要素动态精准管理、业务流程数字化管理、工艺过程智能控制、实物成本精确分析、结构安全与进度耦合分析及联动调控的数字化技术和智能化技术为核心,以水电工程数据模型如大坝全景信息模型DIM为基础,以智能建造管理平台iDam为主体的智能建造技术体系,并对工程数据结构分解与编码体系、工程数据感知传输共享技术、iDam平台的系统架构与业务架构、智能建造工程绩效等关键技术进行了分析。通过统一规范的工程数据结构与编码体系,iDam平台可集成工程建设全过程的基础数据、环境数据、过程数据和监测数据,为各业务模块服务;建立的基于工程技术和管理大数据的机理分析功能,可为工程建设的业主、施工、监理、设计、科研及运行等单位服务。智能建造初步实践表明,本文构建的技术体系是科学可行的,对基础设施智能建造技术与管理体系的研究与实践具有参考价值。     

On the capacity of the state‐dependent interference relay channel

This paper considers the state‐dependent interference relay channel (SIRC) in which one of the two users may operate as a secondary user and the relay has a noncausal access to the signals from both users. For discrete memoryless SIRC, we first establish the achievable rate region by carefully merging Han‐Kobayashi rate splitting encoding technique, superposition encoding, and Gelfand‐Pinsker encoding technique. Then, based on the achievable rate region that we derive, the capacity of the SIRC is established in many different scenarios including (a) the weak interference regime, (b) the strong interference regime, and (c) the very strong interference regime. This means that our capacity results contain all available known results in the literature. Next, the achievable rate region and the associated capacity results are also evaluated in the case of additive Gaussian noise. Additionally, many numerical examples are investigated to show the value of our theoretical derivations.     

Learning a Deep Predictive Coding Network for a Semi-Supervised 3D-Hand Pose Estimation

In this paper we present a CNN based approach for a real time 3D-hand pose estimation from the depth sequence. Prior discriminative approaches have achieved remarkable success but are facing two main challenges: Firstly, the methods are fully supervised hence require large numbers of annotated training data to extract the dynamic information from a hand representation. Secondly, unreliable hand detectors based on strong assumptions or a weak detector which often fail in several situations like complex environment and multiple hands. In contrast to these methods, this paper presents an approach that can be considered as semi-supervised by performing predictive coding of image sequences of hand poses in order to capture latent features underlying a given image without supervision. The hand is modelled using a novel latent tree dependency model (LDTM) which transforms internal joint location to an explicit representation. Then the modeled hand topology is integrated with the pose estimator using data dependent method to jointly learn latent variables of the posterior pose appearance and the pose configuration respectively. Finally, an unsupervised error term which is a part of the recurrent architecture ensures smooth estimations of the final pose. Experiments on three challenging public datasets, ICVL, MSRA, and NYU demonstrate the significant performance of the proposed method which is comparable or better than state-of-the-art approaches.      

基于高光谱图像的改进SIFT特征提取与匹配

针对尺度不变特征变换(SIFT)算法所提取图像特征点数量少、误匹率高的问题,提出了一种基于高光谱图像的改进SIFT算法。首先,依据传统SIFT算法中高斯金字塔的构造思想,结合在不同波段下的高光谱图像具有相同宏观特征的特点,首次用高光谱图像作为原始算法中经高斯变换产生的图像,使得检测到的具有实际意义的特征点数量大幅增加;其次,传统SIFT算法以及大量的改进方法都只通过目标象元邻域范围内的像素信息来构造特征描述符,而忽略了像素点的位置信息,文中将目标象元的位置信息纳入了特征描述符,在特征描述符的匹配阶段,在利用邻域范围内的像素信息进行粗匹配之后,利用特征描述符中的位置信息进行精细匹配。仿真实验结果表明在限定最优值与次优值之比的情况下,采用高光谱图像构造高斯金字塔的方式能显著增加特征点的提取数量,更多地挖掘出图像中的极值点;在特征描述符中加入目标象元的位置信息作为特征点匹配第二阶段的判断依据,正确匹配数量达到原方法的59倍以上,极大提升了算法的匹配性能。